class Solution
{
public:
    int longestOnes(vector<int>& nums, int k)
    {
        int n = nums.size(), count = 0;
        int ret = 0;
        for (int left = 0, right = 0; right < n; right++)
        {
            if (nums[right] == 0)
            {
                count++;
            }
            while (count > k)
            {
                if (nums[left++] == 0)
                {
                    count--;
                }
            }
            ret = max(ret, right - left + 1);
        }
        return ret;
    }
};